An Optimization Algorithm for Minimum Connected Dominating Set Problem in Wireless Sensor Network
نویسندگان
چکیده
One of the critical issues in wireless sensor network is the design of a proper routing protocol. One possible approach is utilizing a virtual infrastructure, which is a subset of sensors to connect all the sensors in the network. Among the many virtual infrastructures, the connected dominating set is widely used. Since a small connected dominating set can help to decrease the protocol overhead and energy consumption, it is preferable to find a small sized connected dominating set. Although many algorithms have been suggested to construct a minimum connected dominating set, there have been few exact approaches. In this paper, we suggest an improved optimal algorithm for the minimum connected dominating set problem, and extensive computational results showed that our algorithm outperformed the previous exact algorithms. Also, we suggest a new heuristic algorithm to find the connected dominating set and computational results show that our algorithm is capable of finding good quality solutions quite fast.
منابع مشابه
ساخت توپولوژی انرژیآگاه با مکانیزم نگهداری در شبکههای حسگر بیسیم
Wireless sensor networks (WSN) is presented solution for the problem of low-cost and flexible monitoring event, especially in places with limited access or dangerous for humans. Wireless sensor networks are built from wireless devices with limited resources thus to Long-Term survival of the Network must use energy-efficient mechanisms, algorithms and protocols. one of th...
متن کاملOn connected domination in unit ball graphs
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each vertex outside D has at least one neighbor in D. Approximations of minimum connected dominating sets are often used to represent a virtual routing backbone in wireless networks. This paper first proposes a constant-ratio...
متن کاملLeveraging 1-hop Neighborhood Knowledge for Connected Dominating Set in Wireless Sensor Networks
To improve the efficiency of routing and broadcast and reducing energy consumption in the process of data transmission, calculating minimum connected dominating set is always used to construct virtual backbone network in wireless sensor networks. Calculating the minimum connected dominating set (MCDS) of plane graphs is a NPcomplete problem. In this paper, an algorithm leveraging 1hop neighborh...
متن کاملA Backbone Formation Algorithm in Wireless Sensor Network Based on Pursuit Algorithm
-In wireless sensor network, virtual backbone formulation is a cost effective method to complete the broadcasting. Minimum connected dominating set is an outstanding candidate of virtual backbone. However, it is NP-Hard to find a minimum connected dominating set in an arbitrary graph. In this paper, we propose a novel backbone formation algorithm to construct a connected dominating set. In the ...
متن کاملOn minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm
Modeling network topologies of wireless sensors used primarily domination theory in graphs. Indeed, many dominating structures have been proposed as virtual backbones for wireless networks. In this paper, we study a dominating set that we call Weakly Connected Independent Set (wcis). Given an undirected connected graph G = (V,E), we say that an independent set S in G is weakly connected if the ...
متن کامل